A Projection Pursuit Algorithm for Exploratory Data Analysis
نویسندگان
چکیده
An algorithm for the analysis of multivariate data is presented, and discussed in terms of specific examples. The algorithm seeks to find oneand two-dimensional linear projections of multivariate data that are relatively highly revealing. *Supported by the U.S. Atomic Energy Commission under Contract AT(@+3)515. **Prepared in part in connection with research at Princeton University supported by the U.S. Atomic Energy Commission. (Submitted to IEEE Trans. on Computers)
منابع مشابه
انجام یک مرحله پیش پردازش قبل از مرحله استخراج ویژگی در طبقه بندی داده های تصاویر ابر طیفی
Hyperspectral data potentially contain more information than multispectral data because of their higher spectral resolution. However, the stochastic data analysis approaches that have been successfully applied to multispectral data are not as effective for hyperspectral data as well. Various investigations indicate that the key problem that causes poor performance in the stochastic approaches t...
متن کاملEntropy in Multivariate Analysis: Projection Pursuit
Projection pursuit is an exploratory data-analytic method in multivariate (MV) analysis. It is similar to the well-known principal components analysis (PCA) in that it can be used to nd interesting structure within a MV data set. However, unlike PCA, which nds linear projections of maximum variance, projection pursuit nds linear projections of maximum non-normality, which sometimes is better at...
متن کاملA Note on Projection Pursuit
I provide a historic review of the forward and backward projection pursuit algorithms, previously thought to be equivalent, and point out an important difference between the two. In doing so, I correct a small error in the original exploratory projection pursuit paper (Friedman 1987). The implication of the difference is briefly discussed in the context of an application in which projection pur...
متن کاملOn the Forward and Backward Algorithms of Projection Pursuit1 by Mu Zhu
This article provides a historic review of the forward and backward projection pursuit algorithms, previously thought to be equivalent, and points out an important difference between the two. In doing so, a small error in the original exploratory projection pursuit article by Friedman [J. Amer. Statist. Assoc. 82 (1987) 249–266] is corrected. The implication of the difference is briefly discuss...
متن کاملInterpretable Projection Pursuit*
The goal of this thesis is to modify projection pursuit by trading accuracy for interpretability. The modification produces a more parsimonious and understandable model without sacrificing the structure which projection pursuit seeks. The method retains the nonlinear versatility of projection pursuit while clarifying the results. Following an introduction which outlines the dissertation, the fi...
متن کاملProjection Pursuit for Exploratory Supervised Classification
In high-dimensional data, one often seeks a few interesting low-dimensional projections that reveal important features of the data. Projection pursuit is a procedure for searching high-dimensional data for interesting low-dimensional projections via the optimization of a criterion function called the projection pursuit index. Very few projection pursuit indices incorporate class or group inform...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Computers
دوره 23 شماره
صفحات -
تاریخ انتشار 1974